Statistical Properties of Modulo-p Added p-Ary Sequences
نویسنده
چکیده
Binary sequences are the most fundamental random numbers and have been extensively used in several applications such as spread-spectrum CDMA communications and cryptosystems. M-sequences, Kasami sequences, and Gold sequences, all of which can be generated by linear feedback shift registers (LFSRs), are well known as conventional binary sequences [1]. It is also well known that chaos phenomena can be used to generate random numbers and have been studied by many researchers, some of which are also engaged in binary sequences called chaotic binary sequences [2]. Since modulo-2 addition is one of fundamental operations for binary variables, we have studied statistical properties of modulo-2 added binary sequences [3]. We have shown that if one sequence is balanced and i.i.d. (independent and identically distributed), then the modulo-2 added sequence is also balanced and i.i.d., which is independent of the other binary sequence. Furthermore, we have also given some conditions to generate two modulo-2 added sequences which are completely uncorrelated to each other from a single chaotic real-valued sequence. In this paper, we discuss statistical properties of sequences obtained by modulo-p addition of two p-ary sequences, that is, we generalize some results for modulo-2 added binary sequences to the p-ary case. First, we theoretically evaluate statistics of sequences obtained by modulop addition of two general p-ary random variables. Under an assumption, we show that if one sequence is k-distributed, then the modulo-p added sequence is also k-distributed, which is independent of the other sequence. Next, we consider statistics of modulo-p added chaotic p-ary sequences generated by one-dimensional chaotic maps. Our theoretical evaluation based on the theory of chaotic dynamical systems [2],[4] shows that if one sequence is balanced and i.i.d., then the modulo-p added sequence is also balanced and i.i.d., which is independent of the other chaotic p-ary sequence. Furthermore, some conditions for generating two modulo-p added sequences which are completely independent of each other from a single chaotic real-valued sequence are also given.
منابع مشابه
Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence
In modern stream cipher, there are many algorithms, such as ZUC, LTE encryption algorithm and LTE integrity algorithm, using bit-component sequences of p-ary m-sequences as the input of the algorithm. Therefore, analyzing their statistical property (For example, autocorrelation, linear complexity and 2-adic complexity) of bit-component sequences of p-ary m-sequences is becoming an important res...
متن کاملA Short Survey of P-ary Pseudo-random Sequences
One of the most important problems in the sequence design is to find sequences with good correlation properties. Recently, expect for the binary Pseudo-Random Sequences (PRSs), much progress has been obtained for ternary and p-ary PRSs. In this paper a short survey of p-ary PRSs and their properties is made. As a result their classification is suggested without claiming its full completeness.
متن کاملBinary Prime Tableau Sequences
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual t...
متن کاملCryptographic properties of Groth sequences
In stream cipher the terms of an infinite binary seOluel1ce are added modulo two to binary plaintext to form One method Groth for this is to sum second products of the stages of maximal length sequence the products are defined by a Langford It was claimed that could be produced in this fashion with maximum provided are used. In this paper these sequences are by using recent results on stream
متن کاملOn set systems with restricted intersections modulo p and p-ary t-designs
We consider bounds on the size of families F of subsets of a v-set subject to restrictions modulo a prime p on the cardinalities of the pairwise intersections.We improve the known bound when F is allowed to contain sets of different sizes, but only in a special case. We show that if the bound for uniform families F holds with equality, then F is the set of blocks of what we call a p-ary t-desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005